Dynamic Modeling of Problem Drinkers Undergoing Behavioral Treatment
نویسندگان
چکیده
منابع مشابه
Dynamic Modeling of Problem Drinkers Undergoing Behavioral Treatment.
We use dynamical systems modeling to help understand how selected intra-personal factors interact to form mechanisms of behavior change in problem drinkers. Our modeling effort illustrates the iterative process of modeling using an individual's clinical data. Due to the lack of previous work in modeling behavior change in individual patients, we build our preliminary model relying on our unders...
متن کاملDynamic Modeling of Behavior Change in Problem Drinkers
We present a novel dynamical systems modeling approach to understand the processes governing an individual’s behavior in the context of problem drinking. Recent advances in technology have resulted in large intensive longitudinal data sets which are particularly well suited for study within such frameworks. However, the lack of previous work in this area (specifically, on the interand intra-per...
متن کاملAttrition in Web-Based Treatment for Problem Drinkers
BACKGROUND Web-based interventions for problem drinking are effective but characterized by high rates of attrition. There is a need to better understand attrition rates in order to improve the completion rates and the success of Web-based treatment programs. OBJECTIVE The objectives of our study were to (1) examine attrition prevalence and pretreatment predictors of attrition in a sample of o...
متن کاملMotivational Interviewing with Problem Drinkers
Motivational interviewing is an approach based upon principles of experimental social psychology, applying processes such as attribution, cognitive dissonance, and self-efficacy. Motivation is conceptualized not as a personality trait but as an interpersonal process. The model deemphasizes labeling and places heavy emphasis on individual responsibility and internal attribution of change. Cognit...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Biology
سال: 2017
ISSN: 0092-8240,1522-9602
DOI: 10.1007/s11538-017-0282-5